Perfect matchings in 4-uniform hypergraphs
نویسنده
چکیده
A perfect matching in a 4-uniform hypergraph is a subset of b4 c disjoint edges. We prove that if H is a sufficiently large 4-uniform hypergraph on n = 4k vertices such that every vertex belongs to more than ( n−1 3 ) − ( 3n/4 3 ) edges then H contains a perfect matching. This bound is tight and settles a conjecture of Hán, Person and Schacht.
منابع مشابه
Exact Minimum Degree Thresholds for Perfect Matchings in Uniform Hypergraphs Iii
We determine the exact minimum l-degree threshold for perfect matchings in k-uniform hypergraphs when the corresponding threshold for perfect fractional matchings is significantly less than 1 2 ( n k−l ) . This extends our previous results [18, 19] that determine the minimum l-degree thresholds for perfect matchings in k-uniform hypergraphs for all l ≥ k/2 and provides two new (exact) threshold...
متن کاملA Note on Perfect Matchings in Uniform Hypergraphs
We determine the exact minimum `-degree threshold for perfect matchings in kuniform hypergraphs when the corresponding threshold for perfect fractional matchings is significantly less than 12 ( n k−` ) . This extends our previous results that determine the minimum `-degree thresholds for perfect matchings in k-uniform hypergraphs for all ` > k/2 and provides two new (exact) thresholds: (k, `) =...
متن کاملPerfect f-matchings and f-factors in hypergraphs - A combinatorial approach
We prove characterizations of the existence of perfect f -matchings in uniform mengerian and perfect hypergraphs. Moreover, we investigate the f -factor problem in balanced hypergraphs. For uniform balanced hypergraphs we prove two existence theorems with purely combinatorial arguments, whereas for non-uniform balanced hypergraphs we show that the f -factor problem is N P-hard.
متن کاملLarge matchings in uniform hypergraphs and the conjectures of Erdős and Samuels
In this paper we study conditions which guarantee the existence of perfect matchings and perfect fractional matchings in uniform hypergraphs. We reduce this problem to an old conjecture by Erdős on estimating the maximum number of edges in a hypergraph when the (fractional) matching number is given, which we are able to solve in some special cases using probabilistic techniques. Based on these ...
متن کاملMatchings and Tilings in Hypergraphs
We consider two extremal problems in hypergraphs. First, given k ≥ 3 and k-partite k-uniform hypergraphs, as a generalization of graph (k = 2) matchings, we determine the partite minimum codegree threshold for matchings with at most one vertex left in each part, thereby answering a problem asked by Rödl and Ruciński. We further improve the partite minimum codegree conditions to sum of all k par...
متن کاملPerfect matchings in 3-partite 3-uniform hypergraphs
Let H be a 3-partite 3-uniform hypergraph with each partition class of size n, that is, a 3-uniform hypergraph such that every edge intersects every partition class in exactly one vertex. We determine the Dirac-type vertex degree thresholds for perfect matchings in 3-partite 3-uniform hypergraphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 116 شماره
صفحات -
تاریخ انتشار 2016